Finding the best tour for travelling salesman problem using artificial ecosystem optimization
نویسندگان
چکیده
This paper presents a new method based on the artificial ecosystem optimization (AEO) algorithm for finding shortest tour of travelling salesman problem (TSP). Wherein, AEO is newly developed idea energy flow living organisms in consisting production, consumption and decomposition mechanisms. In order to improve efficiency TSP problem, 2-opt movement technique equipped enhance quality solutions created by AEO. The effectiveness has been verified four instances 14, 30, 48 52 cities. Based calculated results compared with previous methods, proposed one effective approaches solving problem.
منابع مشابه
A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملImplementation of Travelling Salesman Problem Using ant Colony Optimization
Within the Artificial Intelligence community, there is great need for fast and accurate traversal algorithms, specifically those that find a path from a start to goal with minimum cost. Cost can be distance, time, money, energy, etc. Travelling salesman problem (TSP) is a combinatorial optimization problem. TSP is the most intensively studied problem in the area of optimization. Ant colony opti...
متن کاملParallel Implementation of Travelling Salesman Problem using Ant Colony Optimization
In this paper we have proposed parallel implementation of Ant colony optimization Ant System algorithm on GPU using OpenCL. We have done comparison on different parameters of the ACO which directly or indirectly affect the result. Parallel comparison of speedup between CPU and GPU implementation is done with a speed up of 3.11x in CPU and 7.21x in GPU. The control parameters α, β, ρ is done wit...
متن کاملPopulation-Based Optimization Algorithms for Solving the Travelling Salesman Problem
The Travelling Salesman Problem or the TSP is a representative of a large class of problems known as combinatorial optimization problems. In the ordinary form of the TSP, a map of cities is given to the salesman and he has to visit all the cities only once to complete a tour such that the length of the tour is the shortest among all possible tours for this map. The data consist of weights assig...
متن کاملParallel Implementation of Ant Colony Optimization for Travelling Salesman Problem
A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Power Electronics and Drive Systems
سال: 2021
ISSN: ['2722-2578', '2722-256X']
DOI: https://doi.org/10.11591/ijece.v11i6.pp5497-5504